Programming complexity - PDFSEARCH.IO - Document Search Engine

Programming complexity
Results: 456

#	Item
41	CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-03-15 10:47:56 NP-complete problems Computational complexity theory Analysis of algorithms Operations research NP-hard problems Vertex cover Travelling salesman problem Dynamic programming Parameterized complexity Independent set Algorithm 2-satisfiability
42	CSE 584A Class 22 Jeremy Buhler April 13, 2016 1 Add to Reading List Source URL: classes.engineering.wustl.edu Language: English - Date: 2016-04-13 06:43:23 Complexity classes String matching algorithms Operations research Bitap algorithm NC Bit array FO Dynamic programming
43	50 LINEAR PROGRAMMING Martin Dyer, Bernd G¨artner, Nimrod Megiddo and Emo Welzl Add to Reading List Source URL: people.inf.ethz.ch Language: English - Date: 2016-07-12 11:32:46 Operations research Linear programming Convex optimization Combinatorial optimization Computational geometry Bounding sphere LP-type problem Simplex algorithm Time complexity Mathematical optimization Integer programming Duality
44	Course Syllabus: CS 141: Intermediate Data Structures and Algorithms Winter, 2009 Course Description: Basic algorithm analysis techniques; asymptotic complexity; big-O and big-Omega notations; induction and recurrence re Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2009-01-07 13:50:34 Operations research Algorithms Introduction to Algorithms Mathematical optimization Divide and conquer algorithms Greedy algorithm Dynamic programming Sorting algorithm
45	50 LINEAR PROGRAMMING Martin Dyer, Bernd G¨artner, Nimrod Megiddo and Emo Welzl Add to Reading List Source URL: people.inf.ethz.ch Language: English - Date: 2016-07-12 11:32:46 Operations research Linear programming Convex optimization Combinatorial optimization Computational geometry Bounding sphere LP-type problem Simplex algorithm Time complexity Mathematical optimization Integer programming Duality
46	Introduction & Motivation Relations and Operations The complexity of positive equality-free first-order logic Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2010-09-09 14:15:56 Complexity classes Finite model theory Computational complexity theory Descriptive complexity FO Constraint programming Constraint satisfaction problem P Model theory Mathematical logic Constraint satisfaction HO
47	1 On Stochastic Feedback Control for Multi-antenna Beamforming: Formulation and Low-Complexity Algorithms Sun Sun, Min Dong, and Ben Liang Add to Reading List Source URL: www.comm.utoronto.ca Language: English - Date: 2014-05-05 14:44:36 Markov processes Markov models Mathematical optimization Stochastic control Dynamic programming Markov decision process Beamforming Reinforcement learning Optimal control Markov chain Q-learning Control theory
48	1 Software Complexity: Toward a Unified Theory of Coupling and Cohesion David P. DARCY, and Chris F. KEMERER Add to Reading List Source URL: misrc.umn.edu Language: English - Date: 2013-01-15 14:48:35 Software metrics Software architecture Cohesion Programming complexity Coupling Complexity Structural cohesion Software maintenance Modularity
49	Under consideration for publication in J. Functional Programming 1 FUNCTIONAL PEARLS Probabilistic Functional Programming in Haskell Add to Reading List Source URL: web.engr.oregonstate.edu Language: English - Date: 2005-07-18 18:08:19 Probability distributions Probability theory Probabilistic complexity theory Monty Hall problem Normalizing constant Expected value Normal distribution Uniform distribution Distribution Probabilistic Turing machine
50	CS261: A Second Course in Algorithms Lecture #15: Introduction to Approximation Algorithms∗ Tim Roughgarden† February 23, 2016 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-02-28 14:26:27 NP-complete problems Knapsack problem Set cover problem Steiner tree problem Vertex cover Approximation algorithm Greedy algorithm Dynamic programming Minimum spanning tree Algorithm Time complexity NP